منابع مشابه
Dynamic Processor Allocation for Adaptively Parallel Work-Stealing Jobs
This thesis addresses the problem of scheduling multiple, concurrent, adaptively parallel jobs on a multiprogrammed shared-memory multiprocessor. Adaptively parallel jobs are jobs for which the number of processors that can be used without waste varies during execution. We focus on the specific case of parallel jobs that are scheduled using a randomized work-stealing algorithm, as is used in th...
متن کاملAll Your Voices are Belong to Us: Stealing Voices to Fool Humans and Machines
In this paper, we study voice impersonation attacks to defeat humans and machines. Equipped with the current advancement in automated speech synthesis, our attacker can build a very close model of a victim’s voice after learning only a very limited number of samples in the victim’s voice (e.g., mined through the Internet, or recorded via physical proximity). Specifically, the attacker uses voic...
متن کاملScheduling unrelated parallel machines with optional machines and jobs selection
In this paper we study two generalizations of the well known unrelated parallel machines scheduling problem under makespan (Cmax) minimization. First, a situation in which not every available parallel machine should be used and it is desirable to employ only a subset of the parallel machines. This is referred to as “Not all Machines” or NAM in short. This environment applies frequently in produ...
متن کاملScheduling split - jobs on parallel machines
In classical shop scheduling, the tasks corresponding to a job may not be executed in parallel, i.e., their processing times may not overlap. In case these tasks are processes , independent of each other, this assumption is no longer justified. We consider corresponding scheduling problems where each job splits into a number of pairwise independent processes that have to be executed on dedicate...
متن کاملScheduling Linearly Deteriorating Jobs on Multiple Machines
This paper investigates the scheduling problems in which the job processing times do not remain constant but are increasing linear functions of their starting times. Two deteriorating scheduling models, Model 1 and Model 2, for multiple machines are considered, with the goal being to minimize the makespan. In this paper, we propose an efficient heuristic for Model 1 and prove that the ratio of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cambridge Journal of Regions, Economy and Society
سال: 2020
ISSN: 1752-1378,1752-1386
DOI: 10.1093/cjres/rsz025